Maximum Entropy and Variable Strength Defaults

نویسندگان

  • Rachel A. Bourne
  • Simon Parsons
چکیده

A new algorithm for computing the maximum entropy ranking over models is presented. The algorithm handles arbitrary sets of propositional defaults with associated strength assignments and succeeds whenever the set satisfies a robustness condition. Failure of this condition implies the problem may not be sufficiently specified for a unique solution to exist. This work extends the applicability of the maximum entropy approach detailed in [Goldszmidt et a/., 1993]) and clarifies the assumptions on which the method is based.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm for Computing the Maximum Entropy Ranking for Variable Strength Defaults

A new algorithm for computing the maximum entropy ranking (me-ranking) over a set of variable strength defaults is given. Although this requires more information than its predecessor in terms of strengths for defaults, it has a much wider applicability, and allows for greater expressiveness in encoding default knowledge. The algorithm is shown to be sound and complete to the extent that it alwa...

متن کامل

Maximum Entropy and Variable Strength

A new algorithm for computing the maximum entropy ranking over models is presented. The algorithm handles arbitrary sets of proposi-tional defaults with associated strength assignments and succeeds whenever the set satisses a robustness condition. Failure of this condition implies the problem may not be suuciently speciied for a unique solution to exist. This work extends the applicability of t...

متن کامل

Extending the Maximum Entropy Approach toVariable Strength

A generalisation of the maximum entropy (me) approach to default reasoning 7,8] to cater for variable strength defaults is presented. The assumptions on which the original work was based are reviewed and revised. A new algorithm is presented that is shown to compute the me-ranking under these more general conditions. The limitations of the revised approach are discussed and a test for the uniqu...

متن کامل

Explaining default intuitions using maximum entropy

While research into default reasoning is extensive and many default intuitions are commonly held, no one system has yet captured all these intuitions nor given a formal account to motivate them. This paper argues that the extended maximum entropy approach which incorporates variable strength defaults provides a benchmark for default reasoning that is not only objectively motivated but also sati...

متن کامل

Default reasoning using maximum entropy and variable strength defaults

symbols are not loaded with intuitive interpretations. While it is true that a ) c is not an "-consequence of , since it is not probabilistically sound, both falsifying models of a ) c, must either falsify a ) b or b ) c; on the other hand, a ) c has a verifying model, a ^ b ^ c, which does not falsify either; this explains why a) c is an ME-consequence of (for any strength assignment). What th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999